#define _CRT_SECURE_NO_WARNINGS 1

//https://leetcode.cn/problems/kth-largest-element-in-an-array/submissions/
//class Solution {
//public:
//    int findKthLargest(vector<int>& nums, int k)
//    {
//        priority_queue<int> qp(nums.begin(), nums.end());
//        while (--k)
//        {
//            qp.pop();
//        }
//        return qp.top();
//    }
//};

